package leetcode.code0239;

import leetcode.IDebug;
import leetcode.helper.HelpDebug;

public abstract class Solution239 implements IDebug {
	public abstract int[] maxSlidingWindow(int[] nums, int k);

	@Override
	public void debug1() {
		String str = "[1,3,-1,-3,5,3,6,7]";
		int[] nums = HelpDebug.str2array3(str);
		int k = 3;
		String str1 = "[3,3,5,5,6,7]";
		int[] e = HelpDebug.str2array3(str1);
		int[] r = this.maxSlidingWindow(nums, k);
		HelpDebug.compare(e, r);
	}

	@Override
	public void debug2() {
		String str = "[1]";
		int[] nums = HelpDebug.str2array3(str);
		int k = 1;
		String str1 = "[1]";
		int[] e = HelpDebug.str2array3(str1);
		int[] r = this.maxSlidingWindow(nums, k);
		HelpDebug.compare(e, r);
	}

	@Override
	public void debug3() {
		String str = "[1,-1]";
		int[] nums = HelpDebug.str2array3(str);
		int k = 1;
		String str1 = "[1,-1]";
		int[] e = HelpDebug.str2array3(str1);
		int[] r = this.maxSlidingWindow(nums, k);
		HelpDebug.compare(e, r);
	}

	@Override
	public void debug4() {
		String str = "[9,11]";
		int[] nums = HelpDebug.str2array3(str);
		int k = 2;
		String str1 = "[11]";
		int[] e = HelpDebug.str2array3(str1);
		int[] r = this.maxSlidingWindow(nums, k);
		HelpDebug.compare(e, r);
	}

}
